Time of Deterministic Broadcasting in Radio Networks with Local Knowledge

نویسندگان

  • Dariusz R. Kowalski
  • Andrzej Pelc
چکیده

We consider broadcasting in radio networks, modeled as undirected graphs, whose nodes know only their own label and labels of their neighbors. In every step every node acts either as a transmitter or as a receiver. A node acting as a transmitter sends a message which can potentially reach all of its neighbors. A node acting as a receiver in a given step gets a message if and only if exactly one of its neighbors transmits in this step. Bar-Yehuda, Goldreich, and Itai [J. Comput. System Sci., 45 (1992), pp. 104–126] considered broadcasting in this model. They claimed a linear lower bound on the time of deterministic broadcasting in such radio networks of diameter 3. This claim turns out to be incorrect in this model (although it is valid in a more pessimistic model [R. Bar-Yehuda, O. Goldreich, and A. Itai, Errata Regarding “On the time complexity of broadcast in radio networks: An exponential gap between determinism and randomization,” http://www.wisdom.weizmann.ac.il/mathusers/oded/p bgi.html, 2002]). We construct an algorithm that broadcasts in logarithmic time on all graphs from the BarYehuda, Goldreich, and Itai paper (BGI). Moreover, we show how to broadcast in sublinear time on all n-node graphs of diameter o(log logn). On the other hand, we construct a class of graphs of diameter 4, such that every broadcasting algorithm requires time Ω( 4 √ n) on these graphs. In view of the randomized algorithm from BGI, running in expected time O(D logn+ log n) on all n-node graphs of diameter D (cf. also a recent O(D log(n/D) + log n)-time algorithm from [D. Kowalski and A. Pelc, Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing, Boston, 2003, pp. 73–82; A. Czumaj and W. Rytter, Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, Cambridge, MA, 2003, pp. 492–501]), our lower bound gives the first correct proof of an exponential gap between determinism and randomization in the time of radio broadcasting, under the considered model of radio communication.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Broadcasting in Geometric Radio Networks

We consider deterministic broadcasting in geometric radio networks (GRN) whose nodes know only a limited part of the network. Nodes of a GRN are situated in the plane and each of them is equipped with a transmitter of some range r . A signal from this node can reach all nodes at distance at most r from it but if a node u is situated within the range of two nodes transmitting simultaneously, the...

متن کامل

Survey on Media Literacy of Radio and Television Program Producers (Case study: Mazandaran Radio and Television Center)

In the recent decades, advanced technologies in  production, infrastructure and devices for providing content and services have been provided. The audience can use the media of their interest at any time, with the desired devices .Accordingly, there are many differences in the level of media literacy of the people. This study seeks to determine the level of media literacy of the producer of pro...

متن کامل

Improved lower bound for deterministic broadcasting in radio networks

We consider the problem of deterministic broadcasting in radio networks when the nodes have limited knowledge about the topology of the network. We show that for every deterministic broadcasting protocol there exists a network, of radius 2, for which the protocol takes

متن کامل

Fast Radio Broadcasting with Advice

We study deterministic broadcasting in radio networks in the recently introduced framework of network algorithms with advice. We concentrate on the problem of trade-offs between the number of bits of information (size of advice) available to nodes and the time in which broadcasting can be accomplished. In particular, we ask what is the minimum number of bits of information that must be availabl...

متن کامل

یک الگوریتم سیل‌آسای مبتنی بر احتمال تطابقی برای شبکه‌های موردی سیار

Broadcasting is one of the most fundamental operations in mobile ad hoc networks. Broadcasting serves as a building block in many routing protocols. The simplest approach for broadcasting is flooding. However, it generates many redundant messages that cause to loss of scarce resources such bandwidth and battery powers and it may lead to contention, collision and extreme decrease of network perf...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Comput.

دوره 33  شماره 

صفحات  -

تاریخ انتشار 2004